Models and Proofs of Protocol Security: A Progress Report
نویسندگان
چکیده
This paper discusses progress in the verification of security protocols. Focusing on a small, classic example, it stresses the use of program-like representations of protocols, and their automatic analysis in symbolic and computational
منابع مشابه
Research in Cryptography , Information Security and Algorithm Development 9807 - 12 & 26 Progress Report
Professor Goldwasser, together with Barak, Goldreich, and Lindell worked on Resettably-sound proofs and arguments. These concept was previously investigated by Reyzin and Micali in the public-key setting. These protocols maintain soundness even when the prover can reset the verifier to use the same random coins in repeated executions of the protocol. In the current work it is shown that resetta...
متن کاملSecure Two-Party Computation in Applied Pi-Calculus: Models and Verification
Secure two-party computation allows two mutually distrusting parties to compute a function together, without revealing their secret inputs to each other. Traditionally, the security properties desired in this context, and the corresponding security proofs, are based on a notion of simulation, which can be symbolic or computational. Either way, the proofs of security are intricate, requiring fir...
متن کاملComputational soundness of symbolic zero-knowledge proofs
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significant progress was made in proving that Dolev-Yao models offering the core cryptographic operations such as encryption and digital signatures can be sound with respect to actual cryptographic realizations and secu...
متن کاملSecurity proofs of cryptographic protocols
We live in time of computers and scientific and technological progress but this time is also marked with many attacks on big Internet companies. So with expand of Internet people start to protect information that they exchange through Internet. In the Internet world it is necessary for systems as Internet banking, Internet shopping or e-commerce to secure private information that are transferre...
متن کاملTight finite-key analysis for quantum cryptography
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asympt...
متن کامل